SMACD: Semi-supervised Multi-Aspect Community Detection

نویسندگان

  • Ekta Gujral
  • Evangelos E. Papalexakis
چکیده

Community detection in real-world graphs has been shown to benefit from using multi-aspect information, e.g., in the form of “means of communication” between nodes in the network. An orthogonal line of work, broadly construed as semi-supervised learning, approaches the problem by introducing a small percentage of node assignments to communities and propagates that knowledge throughout the graph. In this paper we introduce SMACD, a novel semi-supervised multi-aspect community detection method along with an automated parameter tuning algorithm which essentially renders SMACD parameter-free. To the best of our knowledge, SMACD is the first approach to incorporate multi-aspect graph information and semisupervision, while being able to discover overlapping and non-overlapping communities. We extensively evaluate SMACD’s performance in comparison to state-ofthe-art approaches across eight real and two synthetic datasets, and demonstrate that SMACD, through combining semi-supervision and multi-aspect edge information, outperforms the baselines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MultiBooked: A Corpus of Basque and Catalan Hotel Reviews Annotated for Aspect-level Sentiment Classification

While sentiment analysis has become an established field in the NLP community, research into languages other than English has been hindered by the lack of resources. Although much research in multi-lingual and cross-lingual sentiment analysis has focused on unsupervised or semi-supervised approaches, these still require a large number of resources and do not reach the performance of supervised ...

متن کامل

Active Semi-Supervised Community Detection Based on Must-Link and Cannot-Link Constraints

Community structure detection is of great importance because it can help in discovering the relationship between the function and the topology structure of a network. Many community detection algorithms have been proposed, but how to incorporate the prior knowledge in the detection process remains a challenging problem. In this paper, we propose a semi-supervised community detection algorithm, ...

متن کامل

Semi-supervised Evidential Label Propagation Algorithm for Graph Data

In the task of community detection, there often exists some useful prior information. In this paper, a Semi-supervised clustering approach using a new Evidential Label Propagation strategy (SELP) is proposed to incorporate the domain knowledge into the community detection model. The main advantage of SELP is that it can take limited supervised knowledge to guide the detection process. The prior...

متن کامل

Semi-supervised learning of user-preferred travel schedules

We present a graph-based semi-supervised approach for learning user-preferred travel schedules. Assuming a setting in which a user provides a small number of labeled travel schedules, we classify schedules into desirable and non-desirable. This task is non-trivial since only a small number of labeled points is available. It is further complicated by the fact that each schedule is comprised of m...

متن کامل

Semi - Supervised Learning of User - Preferred Travel Schedules ( Extended Abstract )

We present a graph-based semi-supervised approach for learning user-preferred travel schedules. Assuming a setting in which a user provides a small number of labeled travel schedules, we classify schedules into desirable and non-desirable. This task is non-trivial since only a small number of labeled points is available. It is further complicated by the fact that each schedule is comprised of m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018